Generalized Monge–Ampère Capacities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized neo-additive capacities and updating

This paper shows that, for Choquet expected utility preferences, the axioms consquentialism, state independence and conditional certainty equivalent consistency under updating characterise a family of capacities, which we call Generalized Neo-Additive Capacities (GNAC). This family contains as special cases, among others, neo-additive capacities as introduced by Chateauneuf, Eichberger, and Gra...

متن کامل

Dynamic Facility Location with Generalized Modular Capacities

Location decisions are frequently subject to dynamic aspects such as changes in customer demand. Often, flexibility regarding the geographic location of facilities, as well as their capacities, is the only solution to such issues. Even when demand can be forecast, finding the optimal schedule for the deployment and dynamic adjustment of capacities remains a challenge, especially when the cost s...

متن کامل

General Systems . GENERALIZED CAPACITIES AND BOOLEAN FUZZY LOGIC

We propose an extension principle for fuzzy logic to obtain a Boolean logic able to manage incomplete and partially inconsistent information. Such a logic is strictly related with an extended notion of belief measure. The aim is to give suitable tools to design expert systems able to manage information probabilistic in nature.

متن کامل

Capacities on lattices and k-ary capacities

We propose a general notion of capacity defined on any finite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary capacities. We define key notions such as Möbius transform, derivative, Shapley value and Choquet integral.

متن کامل

Sperner capacities

We determine the asymptotics of the largest family of qualitatively 2{independent k{ partitions of an n{set, for every k > 2. We generalize a Sperner-type theorem for 2{partite sets of KK orner and Simonyi to the k{partite case. Both results have the feature that the corresponding trivial information-theoretic upper bound is tight. The results follow from a more general Sperner capacity theorem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2014

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnu166